An Extended Gradient Model for NUMA Multiprocessor Systems
نویسندگان
چکیده
In this paper, we present the design and implementation of an eeective and scalable dynamic load balancing system for Non-Uniform Memory Access (NUMA) multiprocessors where load balancing is a key issue to achieve adequate eeciency. The proposed load balancing algorithm extends the well-known gradient model to enhance its applicability in a wide range of multiprocessor systems and to improve the overall system performance. A comparative performance study between the two models based on the preliminary simulation results is also reported in the paper.
منابع مشابه
Performance Prediction and Evaluation of Parallel Processing on a NUMA Multiprocessor
Non-Uniform Memory Access (NUMA) architectures make it possible to build large-scale shared memory multiprocessor systems in comparison with non-scalable UniformMemory Access (UMA) architectures. Most NUMA multiprocessor operations such as scheduling and synchronizing processes, accessing data from processors to memory models and allocating distributed memory space to di erent processors, are p...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملAsynchronous Graph Pattern Matching on Multiprocessor Systems
Pattern matching on large graphs is the foundation for a variety of application domains. Strict latency requirements and continuously increasing graph sizes demand the usage of highly parallel in-memory graph processing engines that need to consider non-uniform memory access (NUMA) and concurrency issues to scale up on modern multiprocessor systems. To tackle these aspects, graph partitioning b...
متن کاملNew program model for program partitioning on NUMA multiprocessor systems - Computers and Digital Techniques, IEE Proceedings-
A new program model is presented to accurately represent parallel programs for partitioning and scheduling problems. This model extends the graphic representation of the macrodataflow by considering the complex communication options supported by NUMA systems. The proposed model shows not only task precedence relations but also data sharing status. Moreover, a new partitioning method based on th...
متن کاملPartitioning Strategy Selection for In-Memory Graph Pattern Matching on Multiprocessor Systems
Pattern matching on large graphs is the foundation for a variety of application domains. The continuously increasing size of the underlying graphs requires highly parallel in-memory graph processing engines that need to consider non-uniform memory access (NUMA) and concurrency issues to scale up on modern multiprocessor systems. To tackle these aspects, a fine-grained graph partitioning becomes...
متن کامل